A Simulated Annealing Algorithm with Tabu List for the Multi-Satellite Downlink Schedule Problem Considering Waiting Time

In the multi-satellite and multi-ground station downlink task scheduling problem, waiting time from proposal of to execution will affect its validity. If satellite has multiple communicable ground stations when is proposed, selection problem needs be solved first. After selection, since available conflict between tasks different satellites for same station, specific start should determined. To reduce time, a simulated annealing algorithm with tabu list decision (SATLD) proposed. This method uses two-stage strategy. first stage, improved based on used select station. The second stage combines arrival (DSA-AT) requirement (DSA-RT) determine each single Simulation analysis prove better efficiency shorter total practical value.